#include<bits/stdc++.h>
using namespace std;
int n,a[100010],ans;
queue<int>q;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+n+1);
/*    for(int i=1;i<=n;i++)
        printf("%d ",a[i]);
    printf("\n");*/
    q.push(a[1]);
    int i=2;
    while(i<=n)
    {
        int x=q.front();
        if(a[i]>x)
        {
            q.pop();
            ans++;
            //printf("%d",x);
        }
        q.push(a[i]);
        i++;
    }
    ans=n-ans;
    printf("%d",ans);
    return 0;
}
/*
10
1 2 3 4 5 6 7 8 9 9
*/
